On public-key cryptosystem MST3 and its realization
نویسنده
چکیده
8th Central European Conference on Cryptography 2008 1 versions. Finally, we discuss the choice of suitable parameters for an efficient realization of thesystem and its practical usage.References [1] S. S. Magliveras, D. R. Stinson and Tran van Trung, New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups, J. Cryptology, 15 (2002), 285–297. [2] W. Lempken, S. S. Magliveras, Tran van Trung, W. Wei, A public key cryptosystem based on non-abelian finite groups, submitted to J. Cryptology. [3] S. S. Magliveras, P. Svaba, Tran van Trung, P. Zajac, On the security of a realization of cryptosystem
منابع مشابه
Public key cryptosystem MST3: cryptanalysis and realization
A new type of public key cryptosystem, called MST3, has been recently introduced on the basis of covers and logarithmic signatures for non-abelian finite groups. The class of Suzuki 2-groups has been proposed for a possible realization of the generic scheme. Due to their simple structure, the groups enable us to study the security of the system and also provide an efficient implementation. An e...
متن کاملOn the Security of a Realization of Cryptosystem Mst3
A new type of public key cryptosystem, called MST3, has been recently developed on the basis of logarithmic signatures and covers of finite groups. The Suzuki 2-groups have been suggested for a possible realization of the generic version of MST3. On one hand, due to their structure, the Suzuki 2-groups allow one to study the security complexity of the system, on the other hand they possess a si...
متن کاملQTRU: quaternionic version of the NTRU public-key cryptosystems
In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...
متن کاملEEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
متن کاملStrongly aperiodic logarithmic signatures
Logarithmic signatures for finite groups are the essential constituent of public key cryptosystems MST1 and MST3. Especially they form the main component of the private key of MST3. Constructing new classes of logarithmic signatures having features that do not share with the well-known class of transversal or fused transversal logarithmic signatures, has become a vital issue regarding the use o...
متن کامل